%22Wheels of web%22 visual user interface.
Abstract. We give an overview of the LEDA platform for combinatorial and geometric computing and an account of its development. We discuss our motivation for building LEDA and to what extent we have reached our goals. We also discuss some recent theoretical developments. This paper contains no new technical material. It is intended as a guide to existing publications about the system. We refer the reader also to our web-pages for more information. 1 What is LEDA? LEDA [MN95, MNU96] aims at being a comprehensive software platform for combinatorial and geometric computing. It provides a sizable collection of data types and algorithms. This collection includes most of the data types and algo-rithms described in the text books of the area ([AtHJ83, Meh84, Tar83, CLR90,
MARGIN Maximal frequent subgraph mining.
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the set of maximal frequent subgraphs is much smaller to that of the set of frequent subgraphs. We propose an algorithm that mines the maximal frequent subgraphs while pruning the lattice space considerably. This reduces the number of isomorphism computations which is the kernel of all frequent subgraph mining problems. Experimental results validate the utility of the technique proposed. 1.
Proceedings of the 15th International Conference on Management of Data

Retrospective analysis of RoboCup rescue simulation agent teams.
We introduce the Score Vector, a new evaluation scheme for the agent teams participating in RoboCup Rescue Simulation Competitions. It is a vector of parameters which monitor the game and provide analysis of the game at a microscopic level, and we show its robustness by thorough testing in various scenarios. We further explore the possibility of designing new scenarios to aptly challenge the teams. Categories and Subject Descriptors
Study of Dependencies in Executions of E%2DContract Activities.

Study of Dependencies in Executions of E%2DContract Activities.

Heidi matrix nearest neighbor driven high dimensional data visualization.

An Experiment with Distance Measures for Clustering.
Distance measure plays an important role in clustering data points. Choosing the right distance measure for a given dataset is a non-trivial problem. In this paper, we study various distance measures and their effect on different clustering techniques. In addition to the standard Euclidean distance, we use Bit-Vector based, Comparative Clustering based, Huffman code based and Dominance based distance measures. We cluster both synthetic datasets and one real life dataset using the above distance measures by employing k-means, matrix partitioning and dominance based clustering algorithms. We analyse the results of our study using a real life dataset of cricket and compare the accuracy of various techniques using synthetic datasets. 1
Kshitij A Search and Page Recommendation System for Wikipedia.
Semantic information helps in identifying the context of a document. It will be interesting to find out how effectively this information can be used in recommending related documents in a partially annotated knowledge base such as Wikipedia. In this paper, we present a generic recommendation system that utilizes the stored as well as dynamically extracted semantics from Wikipedia. The system generates two kinds of recommendations- for search results and for each page viewed by the user. It explores different meta-information such as links and categories in this process. Our experiments show that the system is able to yield good quality recommendations and help in improving the user experience. Though the algorithms are tested on Wikipedia, external systems that do not have access to structured data can benefit from the recommendations. 1
Study of Execution Centric Payment Issues in E%2Dcontracts.

Study of Execution Centric Payment Issues in E%2Dcontracts.

MASFMMS Multi Agent Systems Framework for Malware Modeling and Simulation.

Database Driven RoboCup Rescue Server.

Electronic Contracts.
This paper tries to find a solution for the technical aspect as well as for the legal aspect of this discussion. On one hand it will show the problems that turn up when eContracts shall fulfill the requirements of today&#039;s contract law and give some ideas how contract law should be evolved. On the other hand it will discuss the elements that must be included in a technical solution for Secure Electronic Contracts.
Towards simulating billions of agents in thousands of seconds.

Active Meta Modeling Support for Evolving E%2Dcontracts.

A Methodology and Toolkit for Deploying Contract Documents as E%2Dcontracts.

State of the Art in Modeling and Deployment of Electronic Contracts.

SLA Driven Process Security through Monitored E%2Dcontracts.

System Issues in Multi%2Dagent Simulation of Large Crowds.

A Multi%2Dlevel Model for Activity Commitments in E%2Dcontracts.

Actively Evolving Conceptual Models for Mini%2DWorld and Run%2DTime Environment Changes.


State%2Dof%2Dthe%2DArt in Modeling and Deployment of Electronic Contracts.


MARGIN Maximal Frequent Subgraph Mining.
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the set of maximal frequent subgraphs is much smaller to that of the set of frequent subgraphs. We propose an algorithm that mines the maximal frequent subgraphs while pruning the lattice space considerably. This reduces the number of isomorphism computations which is the kernel of all frequent subgraph mining problems. Experimental results validate the utility of the technique proposed. 1.
A Simple Yet Effective Data Clustering Algorithm.

An Architecture for Searching and Indexing Latex Equations in Scientific Literature.


Time Series Forecasting through Clustering %2D A Case Study.


Agent Community Extraction for 2D%2DRoboSoccer.

Enacting Conformance Assessment of Business Processes %2D An ebXML Based Approach in E%2DADOME.

Subset Queries in Relational Databases

An EREC framework for e%2Dcontract modeling%2C enactment and monitoring.

A Secure Workflow Model.
Workflow Management Systems (WFMSs) are becoming very popular and are being used to support many of the day to day workflows in large organizations. One of the major problems with workflow management systems is that they often use heterogeneous and distributed hardware and software systems to execute a given workflow. This gives rise to decentralized security policies and mechanisms that need to be managed. Since security is an essential and integral part of workflows, the workflow management system has to manage and execute the workflows in a secure way. The prolific use of workflow management systems for critical and strategic applications gives rise to a major concern regarding the threats against integrity, authorization, and availability. In this paper, we propose an authorization model with a set of invariants for workflows from the aspects of agents, events and data, and prove that if they hold, the workflow execution is secure. Further, we develop the authorization model by a multi-layered state machine. The novel part of this model is separating the various aspects of control in a workflow and portraying it as a multi-layered architecture for analyzing the flow of authorizations.
Dynamic Materialized View Selection in Data Warehouse Environment.

Cost%2Ddriven vertical class partitioning for methods in object oriented databases.

Multi agent simulation of unorganized traffic.
2009 Commendation certificate from the City of Los Angeles: My PhD thesis on security of multiagent systems initiated and led to the development of the ARMOR (Assistant for Randomized Monitoring over Routes) system currently deployed at the LAX (Los Angeles International) airport to randomize checkpoints on the roadways entering the airport and canine patrol routes within the airport terminals. In this regard, I received a commendation certificate from the City of Los Angeles. The commendation states ”To merit this commendation you have performed an exceptional service to the Airport police Division, the Los Angeles World Airports and the city of Los Angeles. Your outstanding service facilitates the critical link between the laboratory and the operational world. Thank you for your outstanding contributions to the security of our nation.”
View Relevance Driven Materialized View Selection in Data Warehousing Environment.
A data warehouse uses multiple materialized views to efficiently process a given set of queries. These views are accessed by read-only queries and need to be maintained after updates to base tables. Due to the space constraint and maintenance cost constraint, the materialization of all views is not possible. Therefore, a subset of views needs to be selected to be materialized. The problem is NP-hard, therefore, exhaustive search is infeasible. In this paper, we design a View Relevance Driven Selection (VRDS) algorithm based on view relevance to select views. We take into consideration the query processing cost and the view maintenance cost. Our experimental results show that our heuristic aims to minimize the total processing cost, which is the sum of query processing cost and view maintenance cost. Finally, we compare our results against a popular greedy algorithm.
Workflow View Driven Cross%2DOrganizational Interoperability in a Web%2DService Environment.
Abstract: In an E-service environment, workflow involves not only a single organization but also a number of business partners. Therefore, workflow interoperability in such an environment is an important issue for enacting workflows. In this paper, we introduce our approach of using workflow views as a fundamental support for Eservice workflow interoperability and for controlled (sub-)workflows visibility to external parties. We present a meta-model of workflow views and their semantics with example usage. We develop an interoperation model based on workflow views, with a supply-chain E-service cross-organization workflow example. We also propose an implementation of workflow view and cross-organizational interoperability based on contemporary Web service [17] technology, with respect to our E-ADOME workflow engine.
Sprinkling Selections over Join DAGs for Efficient Query Optimization

Evolutionary Algorithms for Allocating Data in Distributed Database Systems.
Abstract. A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites to the site where the query is initiated. The objective of a data allocation algorithm is to determine an assignment of fragments at different sites so as to minimize the total data transfer cost incurred in executing a set of queries. This is equivalent to minimizing the average query execution time, which is of primary importance in a wide class of distributed conventional as well as multimedia database systems. The data allocation problem, however, is NP-complete, and thus requires fast heuristics to generate efficient solutions. Furthermore, the optimal allocation of database objects highly depends on the query execution strategy employed by a distributed database system, and the given query execution strategy usually assumes an allocation of the fragments. We develop a site-independent fragment dependency graph representation to model the dependencies among the fragments accessed by a query, and use it to formulate and tackle data allocation problems for distributed database systems based on query-site and move-small query execution strategies. We have designed and evaluated evolutionary algorithms for data allocation for distributed database systems.
Workflow View Based E%2DContracts in a Cross%2DOrganizational E%2DServices Environment.

An Evaluation of Vertical Class Partitioning for Query Processing in Object%2DOriented Databases.
Vertical partitioning is a design technique for reducing the number of disk accesses to execute a given set of queries by  minimizing the number of irrelevant instance variables accessed. This is accomplished by grouping the frequently accessed instance  variables as vertical class fragments. The complexity of object-oriented database models due to subclass hierarchy and class  composition hierarchy complicates the definition and representation of vertical partitioning of the classes, which makes the problem of  vertical partitioning in OODBs very challenging. In this paper, we develop a comprehensive analytical cost model for processing of  queries on vertically partitioned OODB classes. A set of analytical evaluation results is presented to show the effect of vertical  partitioning, and to study the trade-off between projection ratio vs. selectivity factor vis-a-vis sequential vs. index access. Furthermore,  an empirical experimental prototype supporting vertical class partitioning has been implemented on a commercial OODB tool kit to  validate our analytical cost model.  Index Terms--Class partitioning, vertical partitioning, query processing, object-oriented databases, analytical cost model.  1  (1) Chi-wai Fung is with Department of Computing, Hong Kong Institute of Vocational Education (Tuen Mun),  Vocational Training Council, Tsing Wun Road, Tuen Mun, Hong Kong, China. E-mail: cwfung@vtc.edu.hk.  (2) Kamalakar Karlapalem is with Indian Institute of Information Technology, Gachhibowli, Hyderabad 500019, INDIA.  E-mail: kamal@iiit.net.  (3) Qing Li is with Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong  Kong, CHINA. E-mail: csqli@cityu.edu.hk.  1 
On handling component and transaction failures in multi agent systems.
Multi agent systems are being used for various practical applications like e-commerce, e-auctions and gathering information from the web. Thus there is a need for these systems to be robust. However, agents can fail due to component failures. The atomic tasks taken up by the agents might also fail. So, agents need to recover to a correct state after a failure. This paper deals with the logging required and hence forth the recovery protocol to recover the agent to a correct state. An agent is modeled as a colored Petrinet. By logging the state information of the agent (Petrinet) an agent recovers from failures. For atomicity of tasks in multi-agent systems, linear two-phase commit protocol with some enhancements is proposed
E%2DADOME Enacting Composite E%2Dservices in an Advanced Workflow Environment.

Facilitating Workflow Evolution in an Advanced Object Environment.

Views for Inter%2Dorganization Workflow in an E%2Dcommerce Environment.
Abstract: In an e-commerce or e-service environment, workflow involves not only a single organization but also a number of business partners. Workflow interoperability is therefore an important issue for workflow enactment in such an environment. In this paper, we propose the use of workflow views as a fundamental support for workflow inter-operability and for visibility by external parties. We present taxonomy of workflow views, discuss various components of a workflow view, and their semantics with example usage. We also demonstrate how contracts can be facilitated with a supply-chain example.
A Frame Work for Modeling Electronic Contracts.

XDoC%2DWFMS A Framework for Document Centric Workflow Management System.

Web%2DBased Workflow Evolution in ADOME%2DWFMS.

Web Interface%2DDriven Cooperative Exception Handling in Adome Workflow Management System.

ADOME%2DWFMS Towards Cooperative Handling of Workflow Exceptions.

A Logical Framework for Exception Handling in ADOME Workflow Management System.

Structural Join Index Driven Complex Object Retrieval Mechanisms and Selection.

On Efficient Storage Space Distribution Among Materialized Views and Indices in Data Warehousing Environments.

Gaining Control over Time in Workflow Management Applications.

Efficient query processing with associated horizontal class partitioning in an object relational data warehousing environment.
In an Object Relational Data Warehousing  (ORDW) environment, the semantics of data and  queries can be explicitly captured, represented,  and utilized based on is-a and class composition  hierarchies, thereby resulting in more efficient  OLAP query processing. In this paper, we show  the efficacy in building semantic-rich hybrid  class partitions by incorporating the Associated  Horizontal Class Partitioning (AHCP) technique  on the ORDW schema. Given a set of queries,  we use primary and derived partitioning  algorithms to select (near) optimal AHCPs,  thereby embedding query semantics into the  partitioned framework. Finally, by a cost model,  we analyze the effectiveness of our approach visa  -vis the unpartitioned approach.  1 Introduction  Data warehouse (DW) equips users with more effective decision support tools by integrating enterprise-wide corporate data into a single repository from which business end-users can run reports and perform ad hoc data analysis [CD97]. As DWs con...
Evaluation of Materialized View Indexing in Data Warehousing Environments.

What Can Partitioning Do for Your Data Warehouses and Data Marts%3F
Efficient query processing is a critical requirement for data warehousing systems as decision support  applications often require minimum response times to answer complex, ad-hoc queries having aggregations,  multi-ways joins over vast repositories of data. This can be achieved by fragmenting warehouse  data. The data fragmentation concept in the context of distributed databases aims to reduce query  execution time and facilitates the parallel execution of queries. In this paper, we propose a methodology  for applying the fragmentation technique in a Data Warehouse (DW) star schema to reduce the total  query execution cost. We present an algorithm for fragmenting the tables of a star schema. During  the fragmentation process, we observe that the choice of the dimension tables used in fragmenting the  fact table plays an important role on overall performance. Therefore, we develop a greedy algorithm in  selecting &#034;best&#034; dimension tables. We propose an analytical cost model for executing a set of OLAP  queries on a fragmented star schema. Finally, we conduct some experiments to evaluate the utility of  fragmentation for efficiently executing OLAP queries.  Key Words : Data Warehouses, Star schema, Fragmentation, Query Optimization, Performance Evaluation  1 
Efficient query processing with structural join indexing in an object relational data warehousing environment.

Speeding Up CapBasED%2DAMS Activities through Multi%2DAgent Scheduling.

E%2DAdome A framework for enacting e%2Dservices.

Speeding Up Electronic Commerce Activities Using CapBasED%2DAMS.

Web Interface%2DDriven Cooperative Exeption Handling in ADOME Workflow Management System.



A Framework for Class Partitioning in Object%2DOriented Databases.

OLAP Query Processing for Partitioned Data Warehouses.
On-line analytical processing (OLAP) queries can take hours or even days to execute on very large data warehouses. Therefore, there is a need to employ techniques that can facilitate efficient execution of these queries. Data partitioning concept that has been studied in the context of relational databases aims to reduce query execution time and facilitate the parallel execution of queries. In this paper, we develop a framework for applying the partitioning technique on DW schema (star schema) to reduce the total query execution cost. We develop an analytical cost model for executing a set of OLAP queries on a partitioned star schema. We conduct experiments to evaluate the utility of partitioning in efficiently executing OLAP queries. Finally,we show how partitioning can be used to facilitate parallel execution of OLAP queries.  1 
Data Warehouse Design and Maintenance through View Normalization.

Star%2FSnow%2DFlake Schema Driven Object%2DRelational Data Warehouse %2D Design and Query Processing Strategies.
. The conventional star schema model of Data Warehouse (DW) has its limitations due to the nature of the relational data model. Firstly, this model cannot represent the semantics and operations of multi-dimensional data adequately. Due to the hidden semantics, it is difficult to efficiently address the problems of view design. Secondly, as we move up to higher levels of summary data (multiple complex aggregations), SQL queries do not portray the intuition needed to facilitate building and supporting efficient execution of complex queries on complex data. In light of these issues, we propose the ObjectRelational View (ORV) design for DWs. Using Object-Oriented (O-O) methodology, we can explicitly represent the semantics and reuse view (class) definitions based on the ISA hierarchy and the class composition hierarchies, thereby resulting in a more efficient view mechanism. Part of the design involves providing a translation mechanism from the star/snowflake schema to an O-O representatio...
Security and Privacy Aspects fo Smartflow Internet Payment System.

Prototyping Web%2DBased Smart Flow Multi%2DApplication System using Smart Card Technology.

Temporally Constrained Workflows.

Response Time Driven Multimedia Data Objects Allocation for Browsing Documents in Distributed Environments.
Abstract—Distributed information processing, in many world wide web applications, requires access, transfer, and synchronization of large multimedia data objects (MDOs) (such as, audio, video, and images) across the communication network. Moreover, the end users have started expecting very fast response times and high quality of service. Since the transfer of large MDOs across the communication network contributes to the response time observed by the end users, the problem of allocating these MDOs so as to minimize the response time becomes very challenging. This problem becomes more complex in the context of hypermedia documents (web pages), wherein the MDOs need to be synchronized during presentation to the end users. Note that the basic problem of data allocation in distributed database environments is NP-complete. Therefore, there is a need to pursue and evaluate solutions based on heuristics which generate near-optimal MDO allocation. In this paper, we address this problem by: 1) conceptualizing this problem by using a navigational model to represent hypermedia documents and their access behavior from end users, and by capturing the synchronization requirements on MDOs, 2) formulating the problem by developing a base case cost model for response time, and generalizing it to incorporate user interaction and buffer memory constraints, 3) designing two algorithms to find near-optimal solutions for allocating MDOs of the hypermedia documents while adhering to the synchronization requirements, and 4) evaluating the trade-off between the time complexity to get the solution and the quality of solution by comparing the solutions generated by the algorithms with the optimal solutions generated through an exhaustive search. Index Terms—Data allocation, response time, multimedia data objects, hypermedia documents, distributed hypermedia document systems, navigational model. 1
A Meta Modeling Approach to Workflow Management Systems Supporting Exception Handling.
Workflow Management Systems (WFMSs) facilitate the definition of structure and decomposition of business processes and assists in management of coordinating, scheduling, executing and monitoring of such activities. Most of the current WFMSs are built on traditional relational database systems and/or using an objectoriented database system for storing the definition and run time data about the workflows. However, a WFMS requires advanced modeling functionalities to support adaptive features, such as on-line exception handling. This article describes our advanced meta-modeling approach using various enabling technologies (such as object orientation, roles, rules, active capabilities) supported by an integrated environment, the ADOME, as a solid basis for a flexible WFMS involving dynamic match making, migrating workflows and exception handling. Copyright 1999 Elsevier Science Ltd  Key words: Meta-modeling, Object-Orientation, Workflow Management, Match-Making, Exception Handling, Workflo...
Least Privilege Security in CapBasED%2DAMS.

Methodology of Schema Integration for New Database Applications A Practitioner%27s Approach.

An Iterative Approach for Rules and Data Allocation in Distributed Deductive Database Systems.

Allocating Data Objects to Multiple Sites for Fast Browsing of Hypermedia Documents.
Many world wide web applications require access, transfer, and synchronization of large multimedia data objects (MDOs) (such as, audio, video, and images) across the communication network. The transfer of large MDOs across the network contributes to the response time observed by the end users. As the end users expect strict adherence to response time constraints, the problem of allocating these MDOs so as to minimize response time becomes very challenging. The problem becomes more complex in the context of hypermedia documents (web pages), wherein these MDOs need to be synchronized during presentation to the end users. Since the basic problem of data allocation in distributed database systems is NP-complete, a need exists to pursue and evaluate solutions based on heuristics for generating near-optimal MDO allocations. In this paper, we i) conceptualize this problem by using a navigational model to represent hypermedia documents and their access behavior from end users, ii) formulate the problem by developing a base case cost model for response time, iii) design two algorithms to find near-optimal solutions for allocating MDOs of the hypermedia documents while adhering to the synchronization requirements, and iv) evaluate the trade-off between time complexity to get the solution and quality of solution by comparing the algorithms solution with exhaustive solution over a set of experiments.  
A Study of Least Privilege in CapBasED%2DAMS.

Query%2DDriven Horizontal Class Partitioning for Object%2DOriented Databases.
. Horizontal partitioning (HP) technique is a logical database design technique first developed for distributed relational (record structured) databases. Though the main objective of HP is to reduce irrelevant data access, there has been very little work done in quantifying this by means of a cost model, and developing algorithms which derive the horizontal partitioning schemes. In this paper, we develop a cost model for query processing in object oriented databases (OODBs) for both unpartitioned and horizontally partitioned object oriented databases. The problem of coming up optimal HP scheme is NP-complete. Therefore, we present and evaluate two algorithms for coming up with optimal (based on exhaustive search) and/or near optimal (based on heuristics) HP schemes. 1 Introduction  OODB technology has matured enough to support modern applications such as CAM/CAD, software engineering and multimedia databases. HP is often used as a means to achieve better performance out of database sys...
Realizing Next Generation Internet Applications Are There Genuine Research Problems

Derived Horizontal Class Partitioning in OODBs Design Strategies

Structural Join Index Hierarchy A Mechanism for Efficient Complex Object Retrieval.

Query optimization using horizontal class partitioning in object oriented databases.
Query processing remains one of the most important challenges of object oriented database systems (OODBSs). A cost model for query processing is very useful in performing the physical query optimization. Horizontal class partitioning (HCP) is a technique for reducing the number of disk accesses for executing a given set of queries by minimizing the number of irrelevant object instances accessed. Moreover, its importance in reduction of query execution time has been widely acknowledged. However, existing cost models for query processing in OODBSs do not take into consideration the HCP criteria. In this paper, we present an analytical cost model for query execution for unpartitioned and horizontally partitioned classes. This cost is necessary for deciding whether to use HCP or to keep all classes unpartitioned. The effect of HCP upon the query execution process is analyzed.  Key Words : Object-oriented database, horizontal class partitioning, cost model, query processing, query optimizat...
Complex Methods and Class Allocation in Distributed Object%2DOriented Database Systems.

A Data Allocation Algorithm for Distributed Hypermedia Documents.

Poster on Exception Handling in ADOME Workflow Management System.

A Paradigm for Security Enforcement in CapBasED%2DAMS.

Cost%2DDriven Evaluation of Vertical Class Partitioning in Object%2DOriented Databases.

Query%2DDriven Data Allocation Algorithms for Distributed Database Systems.
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring multiple database objects (fragments) accessed by a query from different sites to the site where the query is initiated. The objective of a data allocation algorithm is to locate the fragments at different sites so as to minimize the total data transfer cost incurred in executing a set of queries. We develop a site-independent fragment dependency graph representation to model the dependencies among the fragments accessed by a query, and use it to formulate and solve data allocation problems for distributed database systems based on (query-site and move-small) query execution strategies. We show that an optimal solution can be achieved when the query-site query execution strategy is employed, and for the move-small query execution strategy we performed experimental evaluation about the effectiveness of a hillclimbing heuristic algorithm in achieving a near-optimal soluti...
Horizontal Class Partitioning in Object%2DOriented Databases.
. Horizontal partitioning (HP) technique is a logical database design technique first developed for distributed relational (record structured) databases. Though the main objective of HP is to reduce irrelevant data access, there has been very little work done in quantifying this by means of a cost model, and developing algorithms which derive the horizontal partitioning schemes. In this paper, we develop a cost model for query processing in object oriented databases (OODBs) for both unpartitioned and horizontally partitioned object oriented databases. The problem of coming up optimal HP scheme is NP-complete. Therefore, we present and evaluate two algorithms for coming up with optimal (based on exhaustive search) and/or near optimal (based on heuristics) HP schemes. 1 Introduction  OODB technology has matured enough to support modern applications such as CAM/CAD, software engineering and multimedia databases. HP is often used as a means to achieve better performance out of database sys...
A Framework for Designing Materialized Views in Data Warehousing Environment.
Data warehouses may contain multiple views with different query frequencies. When these views are related to each other and defined over overlapping portions of the base data, then it may be more efficient not to materialize all the views, but rather to materialize certain &#034;shared&#034; portions of the base data, from which the warehouse views can be derived. In this paper, we address some issues related to determining this set of shared views to be materialized in order to achieve the best combination of good performance and low maintenance. We further develop an algorithm for achieving this goal; we also discuss some existing research work which can be applied to materialized view design within our framework. The Hong Kong University of Science &amp; Technology Technical Report Series Department of Computer Science A Framework for Designing Materialized Views in Data Warehousing Environment Jian Yang Dept of Computer Science University College University of New South Wales Canberra ACT 26...
Tackling the Challenges of Materialized View Design in Data Warehousing Environment.
How to design materialized views in a data warehousing environment is an important problem which has been largely overlooked in the past? If we regard data warehouse queries as integrated views over the base databases, then there exists a need of selecting a set of views to be materialized so that the best combination of good performance and low maintenance cost can be achieved. In this paper, we compare materialized view design (MVD) work with such related problems as common subexpressions and multiple query processing, discuss the unique requirements of MVD, and outline possible solutions of addressing some of the challenging issues of MVD. 1. Introduction  Providing integrated access to multiple, distributed, heterogeneous databases and other information sources has become one of the leading issues in database research and industry [2]. The traditional approach to this problem is based on a very general two-step process: (1) determine the appropriate set of information sources to an...
A Logical Framework for Security Enforcement in CAPBASED%2DAMS.

Algorithms for Materialized View Design in Data Warehousing Environment.
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a frame-work for analyzing the issues in selecting views to materialize so as to achieve the best com-bination of good query performance and low view maintenance. We first develop a heuristic algorithm which can provide a feasible solu-tion based on individual optimal query plans. We also map the materialized view design problem as O-l integer programming problem, whose solution can guarantee an optimal so-lution. 1
A Logical Framework for Security Enforcement in CAPBASED%2DAMS.

Method Induced Partitioning Schemes for Object%2DOriented Databases.
Object-oriented database systems are becoming popular and are being used in a large number of application domains. Many of these application domains are inherently distributed. The focus of this work is on articulating the concepts of method induced partitioning schemes in object-oriented databases by understanding and classifying the object behavior embodied by the methods. We provide a solution for supporting fragmentation transparency by using method transformation. Finally, we present guidelines for method induced partitioning in object-oriented databases. 1 Introduction  The current trend in information management is towards a distributed, object-oriented database environment [5, 12]. In such an environment, new techniques are needed to facilitate effective object distribution and partitioning, since traditional relational approaches to these problems tend to be deficient/inadequate for object-oriented databases (OODBs) due to a number of unique features (like, complex object mode...
CapBasED%2DAMS A Capability%2Dbased and Event%2Ddriven Activity Management System.

Design and Evaluation of Data Allocation Algorithms for Distributed Multimedia Database Systems.
Given a distributed multimedia database system and a set of queries as well as their frequencies from each site, the objective of a data allocation algorithm is to locate the multimedia data objects (MDOs) at different sites so as to minimize the total data transfer cost incurred in executing the queries. The data allocation problem, however, is NP-complete, and thus requires fast heuristics to generate efficient solutions. In this paper we propose three data allocation algorithms which are based on a genetic technique, an evolutionary process, and neural networks. We have implemented and evaluated these algorithms on our distributed multimedia database system test-bed. A comparison of the algorithms reveals trade-offs between their solution quality and time-complexity. 1
Optimal Redesign Policies to Support Dynamic Processing of Applications on a Distributed Relational Database System.
An application processing center consists of a set of well-defined, well-designed and well-tested applications that are dynamically executed over a period of time. We assume that there is a set of candidate distributed database designs each of which is optimal for some applications. The random execution of applications on a distributed database design is modeled as a discrete Markov process, and the problem of selecting the candidate design for each execution of an application is solved by using sequential Markovian decision process analysis to generate an optimal redesign policy vector. The scope of the methodology developed in this paper is applicable to environments similar to application processing centers. The viability of this methodology is illustrated by means of a case study conducted at Georgia Tech. 1 Introduction  Relational database system technology has been under development for more than two decades. There are many efficient commercial relational database systems in exi...
CapBasED%2DAMS %2D A Framework for Capability%2DBased and Event%2DDriven Activity Management System.
Activity management system deals with management and execution of activities. A problem solving agent is a human, or a hardware, or a software system having an ability to execute activities. An activity consists of multiple interdependent tasks that need to be coordinated, scheduled and executed by a set of problem solving agents, where each task is an atomic activity executed by exactly one problem solving agent. In this paper, we develop a framework for activity management system through capabilitybased activity specification, decomposition and identification of the problem solving agents to execute the tasks, and event-driven execution of the activities.  1 Introduction  Many application domains like, office automation, planning, medical diagnosis, manufacturing systems, etc., need interaction between and humans and systems, and among humans for conducting day-to-day work. The problems in these application domains have been modeled by using different frameworks like, distributed coo...
Partitioning Schemes for Object Oriented Databases.
In order to support homogeneous distributed object oriented database systems we need to have a clear understanding of what is meant by partitioning a class and what are the different ways of doing so. In this paper, we concentrate on studying the different types of class partitioning schemes that can arise in object oriented databases. By laying down the foundation by articulating the concepts, representation, and implementation approaches for partitioning object databases, we facilitate further work on partitioning algorithms, query decomposition, optimization and transaction management for distributed OODBMS.  1 Introduction  Object oriented databases (OODBs) have been gaining popularity since late 80&#039;s when several OODBs became commercially available. Earlier work on OODBs has mainly concentrated on centralized database environments, and only more recently has OODBs technology been applied in distributed systems environments (e.g. client-server and and federated multiple-databases [...
HODFA An Architectural Framework for Homogenizing Heterogeneous Legacy Database.
One of the main difficulties in supporting global applications over a number of localized databases and migrating legacy information systems to modern computing environment is to cope with the heterogeneities of these systems. In this paper, we present a novel flexible architecture (called HODFA) to dynamically connect such localized heterogeneous databases in forming a homogenized federated database system and to support the process of transforming a collection of heterogeneous information systems onto a homogeneous environment. We further develop an incremental methodology of homogenization in the context of our HODFA framework, which can facilitate different degrees of homogenization in a stepwise manner, so that existing applications will not be affected during the process of homogenization. 1. A two page synopsis of this work will appear as a poster paper in 7th International conference on Parallel and Distributed Computing Systems, Las Vegas, 1994.  1 Introduction and Motivation ...
Data and Knowledge Base Research at Hong Kong University of Science and Technology.

Database Supported Cooperative Problem Solving.
There are a number of problems in office environments, medical diagnosis, and planning  that require cooperation among agents (either active or passive) for their solutions.  Briefly, cooperative problem solving can be viewed as a complex activity requiring  harmonious and dynamic interaction between active agents (typically humans -- providing  sequencing, decision making, and coordination components) and passive agents  (typically computing systems -- providing inferencing, algorithmic computation, and  Data/knowledge storage). By definition, a problem in this category cannot be solved  by an individual problem solving agent without cooperation among the problem solving  agents although each component (or the problem solving agent involved in problem  solving) is autonomous and is capable of sophisticated problem solving. This problem  is currently being addressed by the research community at various levels of abstraction.  Broadly, this paper analyzes the problem of cooperative prob...
Issues in Distribution Design of Object%2DOriented Databases.
The performance of applications on Object Oriented Database Management Systems (OODBMSs) is strongly affected by Distributed Design, which reduces irrelevant data accessed by applications and data exchange among sites. In an OO environment, the Distributed Design is a very complex task, and an open research problem. In this work we propose a knowledge based approach to the fragmentation phase of the distributed design of object oriented databases. In this approach, we will show a rule-based implementation of an analysis algorithm from our previous work and propose some ideas towards the use of Inductive Logic Programming (ILP) to perform a knowledge discovery/revision process using our set of rules as background knowledge. The objective of the work is to uncover some previously unknown issues to be considered in the distributed design process. Our main objective here is to show the viability of performing a revision process in order to obtain better and better fragmentation algorithms....
Relational Database Organization Based on Views and Fragments.

ER%2DR An Enhanced ER Model with Situation%2DAction Rules to Capture Application Semantics.

